Kolmogorov Complexity of Categories
نویسنده
چکیده
Kolmogorov complexity theory is used to tell what the algorithmic informational content of a string is. It is defined as the length of the shortest program that describes the string. We present a programming language that can be used to describe categories, functors, and natural transformations. With this in hand, we define the informational content of these categorical structures as the shortest program that describes such structures. Some basic consequences of our definition are presented including the fact that equivalent categories have equal Kolmogorov complexity. We also prove different theorems about what can and cannot be described by our programming language.
منابع مشابه
Paradigmatic Analysis using Genetic Programming
Paradigmatic analysis consists in the segmentation of a musical piece through the identification of relations between different parts of the piece, and the classification of the identified segments into categories. In this paper we describe how a genetic programming system can be used to make the paradigmatic analysis of monophonic musical pieces, using a simple fitness function inspired in the...
متن کاملAutomatic Meaning Discovery Using Google
We present a new theory of relative semantics between objects, based on information distance and Kolmogorov complexity. This theory is then applied to construct a method to automatically extract the meaning of words and phrases from the world-wide-web using Google page counts. The approach is novel in its unrestricted problem domain, simplicity of implementation, and manifestly ontological unde...
متن کامل3D Scene and Object Classification Based on Information Complexity of Depth Data
In this paper the problem of 3D scene and object classification from depth data is addressed. In contrast to high-dimensional feature-based representation, the depth data is described in a low dimensional space. In order to remedy the curse of dimensionality problem, the depth data is described by a sparse model over a learned dictionary. Exploiting the algorithmic information theory, a new def...
متن کاملThe pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
We continue an investigation into resource-bounded Kolmogorov complexity [ABK06], which highlights the close connections between circuit complexity and Levin’s time-bounded Kolmogorov complexity measure Kt (and other measures with a similar flavor), and also exploits derandomization techniques to provide new insights regarding Kolmogorov complexity. The Kolmogorov measures that have been introd...
متن کاملQuantum Kolmogorov Complexity and its Applications
Kolmogorov complexity is a measure of the information contained in a binary string. We investigate here the notion of quantum Kolmogorov complexity, a measure of the information required to describe a quantum state. We show that for any definition of quantum Kolmogorov complexity measuring the number of classical bits required to describe a pure quantum state, there exists a pure n-qubit state ...
متن کامل